unambiguous grammar

См. также в других словарях:

• Ambiguous grammar — In computer science, a grammar is said to be an ambiguous grammar if there is some string that it can generate in more than one way (i.e., the string has more than one parse tree or more than one leftmost derivation). A language is inherently… …   Wikipedia

• Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… …   Wikipedia

• Lojban grammar — Lojban is a constructed, human speakable and (theoretically) machine speakable language, based on predicate logic. It is one of the latest languages, designed in 1987 with most of its grammar from Loglan and some features from Láadan. Most of its …   Wikipedia

• Parsing expression grammar — A parsing expression grammar, or PEG, is a type of analytic formal grammar that describes a formal language in terms of a set of rules for recognizing strings in the language. A parsing expression grammar essentially represents a recursive… …   Wikipedia

• Esperanto grammar — Esperanto is a constructed auxiliary language. A highly regular grammar makes Esperanto much easier to learn than most other languages of the world, though particular features may be more or less advantageous or difficult depending on the… …   Wikipedia

• HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… …   Encyclopedia of Judaism

• Persian grammar — is similar to many other Indo European languages, especially those in the Indo Iranian family. Since Middle Persian it has had a relatively simple grammar, having no grammatical gender and few case markings.Word OrderWhile Persian has a Subject… …   Wikipedia

• Deterministic context-free language — A deterministic context free language is a formal language which is defined by a deterministic context free grammar.[1] The set of deterministic context free languages is called DCFL[2] and is identical to the set of languages accepted by a… …   Wikipedia

• dis|am|big|u|ate — «DIHS am BIHG yu ayt», transitive verb, at|ed, at|ing. to rid (a sentence, statement, or the like) of ambiguity: »Given a syntactically ambiguous grammar, it is possible to use semantic information to disambiguate its syntax and construct a… …   Useful english dictionary

• Lojban — la lojban. Pronunciation [la ˈloʒban] …   Wikipedia

• Attempto Controlled English — (ACE) is a controlled natural language, i.e. a subset of standard English with a restricted syntax and a restricted semantics described by a small set of construction and interpretation rules [cite conference | author = Norbert E. Fuchs, Kaarel… …   Wikipedia